Code Placement using Temporal Profile Information
نویسندگان
چکیده
Instruction cache performance is important to instruction fetch efficiency and overall processor performance. The layout of an executable has a substantial effect on the cache miss rate and the instruction working set size during execution. This means that the performance of an executable can be improved significantly by applying a code-placement algorithm that minimizes instruction cache conflicts and improves spatial locality. We describe an algorithm for procedure placement, one type of code-placement algorithm, that significantly differs from previous approaches in the type of information used to drive the placement algorithm. In particular, we gather temporal ordering information that summarizes the interleaving of procedures in a program trace. Our algorithm uses this information along with cache configuration and procedure size information to better estimate the conflict cost of a potential procedure ordering. It optimizes the procedure placement for singleand multi-level caches. In addition to reducing instruction cache conflicts, the algorithm simultaneously minimizes the instruction working set size of the program. We compare the performance of our algorithm with a particularly successful procedure-placement algorithm and show noticeable improvements in the instruction cache behavior, while maintaining the same instruction working set size.
منابع مشابه
Simultaneous Placement of Capacitor and DG in Distribution Networks Using Particle Swarm Optimization Algorithm
Nowadays, using distributed generation (DG) resources, such as wind and solar, also improving the voltage profile in distribution companies has been considered. As optimal placement and sizing of shunt capacitors become more prevalent, utilities want to determine the impact of the various capacitors placement in distribution systems. Locating and determining the optimal capacity of shunt capaci...
متن کاملMulti-objective Based Optimization Using Tap Setting Transformer, DG and Capacitor Placement in Distribution Networks
In this article, a multi-objective function for placement of Distributed Generation (DG) and capacitors with thetap setting of Under Load Tap Changer (ULTC) Transformer is introduced. Most of the recent articles have paidless attention to DG, capacitor placement and ULTC effects in the distribution network simultaneously. Insimulations, a comparison between different modes was carried out with,...
متن کاملThe Optimal Placement of Distributed Generation (DG) to Improve the Voltage Profile and Reduce Losses in Radial Distribution Networks Using PSO
Voltage profile and losses are important factors in a distribution network in which there arevariety of ways to improve them. In this paper, distributed generation (DG) is used as a solutionto improve the above characteristics. Backward/Forward Sweep load flow algorithm is used dueto the inefficiency of usual load flow algorithms because of high R/X ratio and their lack ofconvergence in distrib...
متن کاملOptimal DG Placement for Power Loss Reduction and Improvement Voltage Profile Using Smart Methods
Distributed Generations (DGs) are utilized to supply the active and reactive power in the transmission and distribution systems. These types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. In order to reach the above benefits, the optimal placement and sizing of DG is...
متن کاملEvaluation of architectural support for speech codecs application in large-scale parallel machines
Next generation multimedia mobile phones that use the high bandwidth 3G cellular radio network consume more power. Multimedia algorithms such as speech, video transcodecs have very large instruction foot prints and consequently stalled due to instruction cache misses. The conflicts in on-chip caches contribute a large fraction of the CPU cycle penalty and hence increase in power consumption. Ma...
متن کامل